Risk Aware Graph Search With Uncertain Edge Costs
نویسندگان
چکیده
In this paper we present a novel approach to searching a graph with probabilistic edge costs. By incorporating uncertainty information into the graph search we perform risk-aware planning. We present the results through a simple search domain, and report the improved results compared to traditional single heuristic search techniques (A*, D*, and greedy).
منابع مشابه
Risk-Aware Graph Search with Dynamic Edge Cost Discovery
In this paper we introduce a novel algorithm for incorporating uncertainty into lookahead planning. Our algorithm searches through connected graphs with uncertain edge costs represented by known probability distributions. As a robot moves through the graph, the true edge costs of adjacent edges are revealed to the planner prior to traversal. This locally revealed information allows the planner ...
متن کاملON THE MATCHING NUMBER OF AN UNCERTAIN GRAPH
Uncertain graphs are employed to describe graph models with indeterministicinformation that produced by human beings. This paper aims to study themaximum matching problem in uncertain graphs.The number of edges of a maximum matching in a graph is called matching numberof the graph. Due to the existence of uncertain edges, the matching number of an uncertain graph is essentially an uncertain var...
متن کاملA Time Dependent Pollution Routing Problem in Multi-graph
This paper considers a time dependent(the travel time is not constant throughout the day) pollution routing problem (TDPRP), which aids the decision makers in minimizing travel time, toll cost and emitted pollution cost. In complexity of urban areas most of the time one point is accessible from another with more than one edge. In contrast to previous TDPRP models, which are designed with only ...
متن کاملIn Proceedings of the Eleventh Conference on Uncertainty in Artificial Intelligence ( UAI - 95 ) , Montreal , Quebec , Canada , August 18 - 20 , 1995 Path Planning under Time - Dependent
Standard algorithms for nding the shortest path in a graph require that the cost of a path be additive in edge costs, and typically assume that costs are determinis-tic. We consider the problem of uncertain edge costs, with potential probabilistic dependencies among the costs. Although these dependencies violate the standard dynamic-programming decomposition, we identify a weaker stochastic con...
متن کاملPath Planning under Time-Dependent Uncertainty
Standard algorithms for finding the short est path in a graph require that the cost of a path be additive in edge costs, and typically assume that costs are determinis tic. We consider the problem of uncertain edge costs, with potential probabilistic de pendencies among the costs. Although these dependencies violate the standard dynamic programming decomposition, we identify a weaker stocha...
متن کامل